منابع مشابه
Extremal P4-stable graphs
Call a graph G k-stable (with respect to some graph H) if, deleting any k edges of G, the remaining graph still contains H as a subgraph. For a fixed H, the minimum number of edges in a k-stable graph is denoted by S(k). We prove general bounds on S(k) and compute the exact value of the function S(k) for H = P4. The main result can be applied to extremal k-edge-hamiltonian hypergraphs.
متن کاملLaplacian integrality in P4-sparse and P4-extendible graphs
Let G be a simple graph and L = L(G) the Laplacian matrix of G. G is called L-integral if all its Laplacian eigenvalues are integer numbers. It is known that every cograph, a graph free of P4, is L-integral. The class of P4-sparse graphs and the class of P4-extendible graphs contain the cographs. It seems natural to investigate if the graphs in these classes are still L-integral. In this paper ...
متن کاملThe p4 screener: evaluation of a brief measure for assessing potential suicide risk in 2 randomized effectiveness trials of primary care and oncology patients.
BACKGROUND Depression is the most common mental disorder, and suicide is its most serious consequence. The primary objective of this study was to evaluate preliminary evidence for the P4 screener as a brief measure to assess potential suicide risk. METHOD The P4 screener was prospectively evaluated in 2 randomized effectiveness trials of primary care (January 2005-June 2008; N = 250) and onco...
متن کاملMagnetic HUB - P4 Reflection
Project Description The project is located in the twin cities El Paso and Cd Juarez within the border area of United Stated and Mexico. During the field trip, we were about to find out the existing problems on site and try to put forward feasible architectural solutions. After the research and on site visit, it is easily found that Cd Juarez is suffering from the imbalance economic development ...
متن کاملThe P4-structure of perfect graphs
One of the most important outstanding open problems in algorithmic graph theory is to determine the complexity of recognizing perfect graphs. Results of Lovász [33], Padberg [37] and Bland et al. [6] imply, as was first observed by Cameron [10] in 1982, that the problem of recognizing perfect graphs is in co-NP. So far it is not known whether this problem also belongs to NP, i.e., we do not kno...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Primary Care Companion to The Journal of Clinical Psychiatry
سال: 2010
ISSN: 1555-211X
DOI: 10.4088/pcc.10m00978blu